Spectral division methods for block generalized Schur decompositions
نویسندگان
چکیده
منابع مشابه
Spectral division methods for block generalized Schur decompositions
We provide a different perspective of the spectral division methods for block generalized Schur decompositions of matrix pairs. The new approach exposes more algebraic structures of the successive matrix pairs in the spectral division iterations and reveals some potential computational difficulties. We present modified algorithms to reduce the arithmetic cost by nearly 50%, remove inconsistency...
متن کاملAlgorithmic Redistribution Methods for Block-Cyclic Decompositions
This research aims at creating and providing a framework to describe algorithmic redistribution methods for various block cyclic decompositions. To do so properties of this data distribution scheme are formally exhibited. The examination of a number of basic dense linear algebra operations illustrates the application of those properties. This study analyzes the extent to which the general two-d...
متن کاملNew Heuristic Methods for Tree Decompositions and Generalized Hypertree Decompositions
Many practical hard problems in mathematics and computer science may be formulated as constraint satisfaction problems (CSPs). Tree and generalized hypertree decompositions are two important concepts which can be used for identifying and solving tractable classes of CSPs. Unfortunately the task of finding an optimal tree or generalized hypertree decomposition is an NP-complete problem. Thus man...
متن کاملBlock Diagonal Preconditioners for the Schur Complement Method Block Diagonal Preconditioners for the Schur Complement Method
We present numerical methods for solving systems of linear equations originated from the discretisation of two-dimensional elliptic partial diierential equations. We are interested in diierential equations that describe heterogeneous and anisotropic phenomena. We use a nonoverlapping domain decomposition method for solving the linear systems. We describe new local preconditioners for the interf...
متن کاملGeneralized Schur Methods to Computecoprime Factorizations of Rational Matricesa
Numerically reliable state space algorithms are proposed for computing the following stable coprime factorizations of rational matrices: 1) factorizations with least order denominators; 2) factorizations with inner denominators; and 3) factorizations with proper stable factors. The new algorithms are based on a recursive generalized Schur algorithm for pole assignment. They are generally applic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2004
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-04-01667-9